Modal decomposition without a priori scale information
نویسندگان
چکیده
منابع مشابه
Fusing Diagnostic Information Without A Priori Performance Knowledge
Diagnostic information fusion is the method by which one would determine a system’s state for those instances where several different diagnostic tools, and possibly other sources, are used for state estimation. Because system state predictions from different diagnostic tools will disagree at some extent, if not completely contradict one another, a robust fusion tool is necessary to produce a re...
متن کاملVanishing Point Detection without Any A Priori Information
This work was partially funded by the French Space Agency (CNES) and Cognitech Inc. We would like to specially thank JeanMichel Morel for his encouragement, support, ideas, and for introducing us to Gestalt-based image analysis. A. Almansa would also like to thank Lenny Rudin and Pascal Monasse for useful discussions, references, and motivation to address this problem, as well as for adapting a...
متن کاملIndependent Process Analysis Without a Priori Dimensional Information
Recently, several algorithms have been proposed for independent subspace analysis where hidden variables are i.i.d. processes. We show that these methods can be extended to certain AR, MA, ARMA and ARIMA tasks. Central to our paper is that we introduce a cascade of algorithms, which aims to solve these tasks without previous knowledge about the number and the dimensions of the hidden processes....
متن کاملComputational Geometry-Based Scale-Space and Modal Image Decomposition
In this paper a framework for defining scale-spaces, based on the computational geometry concepts of α-shapes, is proposed. In this approach, objects (curves or surfaces) of increasing convexity are computed by selective sub-sampling, from the original shape to its convex hull. The relationships with the Empirical Mode Decomposition (EMD), the curvature motion-based scale-space and some operato...
متن کاملLearning Plans without a priori Knowledge
This paper is concerned with the autonomous learning of plans in probabilistic domains without a priori domain-specific knowledge. In contrast to existing reinforcement learning algorithms that generate only reactive plans, and existing probabilistic planning algorithms that require a substantial amount of a priori knowledge in order to plan, a two-stage bottom-up process is devised in which fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2012
ISSN: 1094-4087
DOI: 10.1364/oe.20.027866